Realisation and dismantlability
نویسندگان
چکیده
We prove that a finite group acting on an infinite graph with dismantling properties fixes a clique. We prove that in the flag complex spanned on such a graph the fixed point set is contractible. We study dismantling properties of the arc, disc and sphere graphs. We apply our theory to prove that any finite subgroup H of the mapping class group of a surface with punctures, the handlebody group, or Out.Fn/ fixes a filling (respectively simple) clique in the appropriate graph. We deduce some realisation theorems, in particular the Nielsen realisation problem in the case of a nonempty set of punctures. We also prove that infinite H have either empty or contractible fixed point sets in the corresponding complexes. Furthermore, we show that their spines are classifying spaces for proper actions for mapping class groups and Out.Fn/ .
منابع مشابه
Dismantlable Classifying Space for the Family of Parabolic Subgroups of a Relatively Hyperbolic Group
Let G be a group hyperbolic relative to a finite collection of subgroups P. Let F be the family of subgroups consisting of all the conjugates of subgroups in P, all their subgroups, and all finite subgroups. Then there is a cocompact model for EFG. This result was known in the torsion-free case. In the presence of torsion, a new approach was necessary. Our method is to exploit the notion of dis...
متن کاملTree-like partial Hamming graphs
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227–240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and ...
متن کاملInfinite limits of the duplication model and graph folding
We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model. We characterize the isomorphism type and induced subgraph structure of these infinite graphs usin...
متن کاملAlgebraic properties and dismantlability of finite posets
We show that every finite connected poser which admits certain operations such as Gumm or J6nsson operations, or a near unanimity function is dismantlable. This result is used to prove that a finite poset admits Gumm operations if and only if it admits a near unanimity function. Finite connected posets satisfying these equivalent conditions are characterized by the property that their idempoten...
متن کامل[hal-00740434, v1] Simplicial simple-homotopy of flag complexes in terms of graphs
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs hav...
متن کامل